A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

Neighborhood search heuristics for selecting hierarchically well‐formulated subsets in polynomial regression

The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well‐formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

一种信号检测模糊技术及其应用

本文基于模糊理论,建立一种信号检测的模糊模型,并实际运用于连续波多普勒测速雷达目标速度的提取,取得了满意的结果     

内外干扰因素对液体火箭发动机的影响分析

在已有的液体火箭发动机稳态工况的非线性数学模型基础上,计算分析了单干扰因素对液体火箭发动机参数的影响,用非线性方法和小偏差方法对比分析了两个干扰因素分别和共同对发动机参数的影响。所得结论可用于泵压式燃气发生器循环的液体火箭发动机试验结果分析、可靠性及故障分析,也揭示了此类发动机参数随各种干扰因素的变化规律     

时序逻辑的并行描述与隐含遍历

随着电路规模的迅速增长,设计验证越来越复杂,从而需要高速的数据处理系统。基于总线型多机系统环境,研究电路网表和布尔表达式的BDD（Binary Decision Diagram）并行构造方法,并通过隐含遍历任务的动态调度设计有效地完成时序逻辑的状态遍历。     

雷达角跟踪系统检测的新方法

本文提出了雷达角跟踪系统检测的一种新方法——暂态特性测试法。文中介绍了该检测方法的原理及由CCD摄象传感器件、单片微机等组成的检测设备。分析了实验结果,讨论了提高检测精度的措施。     

多尺度方法在强非线性系统中应用的一个注释

多尺度法在求解非线性系统时，目前所得到的结果多集中在弱非线性系统上。论文对多尺度法进行了改进。对强非线性杜芬系统进行了变换，得到了强非线性杜芬系统存在3个解的结论，其中大的和小的是稳定的，中间的是不稳定的，物理上实现哪个稳定运动取决于初始条件。     

智能搜救机器人在障碍地形的自主构型规划

为了解决带有辅助摆臂的智能搜救机器人自动规划构型以实现自主越障的难题,提出一种能够适应复杂地面形状的搜救机器人越障构型规划新方法,其核心是一种高适应性、高效率的机器人姿态预测算法。通过将地形表示为离散的点集,建立了搜救机器人的单侧姿态预测数学模型;进一步提出了快速求解该问题的算法,每秒可预测1 000～1 500个姿态。基于此,设计了机器人越障过程中状态、动作的评价指标,运用动态规划算法与滚动优化思想构建了具有优化能力的、能够实时运行的构型规划器。仿真与实物实验的结果表明,该方法能够使机器人自主调整构型穿越复杂地形,且相较强化学习算法和人工操作具有更平稳的越障效果。     

集群搜索对策理论在搜索-规避对抗中的应用

使用对策论的观点和方法 ,结合搜索论的知识 ,建立了一类搜索 -规避对抗对策模型 .对模型的结论做了系统分析 ,考虑了对策双方的最优策略及使用 .     

基于一种模型的中子星结构

从物态方程出发,利用中子星结构方程计算了中子星的结构。得到了引力质量材M_G=1.27M_θ材,转动惯量I=1.29x10(45)g/cm~2,与观测结果符合较好。